11111

COURSE INTRODUCTION AND APPLICATION INFORMATION


se.cs.ieu.edu.tr

Course Name
Code
Semester
Theory
(hour/week)
Application/Lab
(hour/week)
Local Credits
ECTS
Fall
Prerequisites
None
Course Language
Course Type
Required
Course Level
-
Mode of Delivery -
Teaching Methods and Techniques of the Course Problem Solving
Course Coordinator
Course Lecturer(s)
Assistant(s) -
Course Objectives
Learning Outcomes The students who succeeded in this course;
  • be able to precisely state logical argument
  • be able to practically use fundamental mathematical notation and concepts
  • be able to practise basic concepts of mathematical proof (direct proof, proof by contradiction, mathematical induction)
  • be able to handle the standard logical symbols with some confidence
  • be able to solve elementary combinatorial and counting problems
  • be able to simplify complex mathematical expressions and apply general formulas to specific contexts
Course Description

 



Course Category

Core Courses
X
Major Area Courses
Supportive Courses
Media and Managment Skills Courses
Transferable Skill Courses

 

WEEKLY SUBJECTS AND RELATED PREPARATION STUDIES

Week Subjects Required Materials
1 Logic: Basic connectives and Truth tables Chapter 2. Sections 2.1. Discrete and combinatorial mathematics: an applied introduction. R.P. Grimaldi. Fifth Edition. ISBN: 0321211030
2 Logic: Logic equivalences and the laws of logic Chapter 2. Sections 2.2. Discrete and combinatorial mathematics: an applied introduction. R.P. Grimaldi. Fifth Edition. ISBN: 0321211030
3 Logic: The rules of inference Chapter 2. Sections 2.3. Discrete and combinatorial mathematics: an applied introduction. R.P. Grimaldi. Fifth Edition. ISBN: 0321211030
4 Logic: quantifiers and logical inference of quantified statement Chapter 2. Sections 2.4. Discrete and combinatorial mathematics: an applied introduction. R.P. Grimaldi. Fifth Edition. ISBN: 0321211030
5 Theorems and proofs Chapter 2. Sections 2.5. Discrete and combinatorial mathematics: an applied introduction. R.P. Grimaldi. Fifth Edition. ISBN: 0321211030
6 Set theory Chapter 3. Sections 3.1—3.3. Discrete and combinatorial mathematics: an applied introduction. R.P. Grimaldi. Fifth Edition. ISBN: 0321211030
7 Relations; orders and equivalences Chapter 5. Sections 5.1; Chapter 7. Section 7.1—7.4. Discrete and combinatorial mathematics: an applied introduction. R.P. Grimaldi. Fifth Edition. ISBN: 0321211030
8 Functions; Cardinality and bijections Chapter 5. Sections 5.2, 5.3, and 5.6. Discrete and combinatorial mathematics: an applied introduction. R.P. Grimaldi. Fifth Edition. ISBN: 0321211030
9 Mathematical Induction Chapter 4. Discrete and combinatorial mathematics: an applied introduction. R.P. Grimaldi. Fifth Edition. ISBN: 0321211030
10 Basics and counting; Permutations and combinations Chapter 1. Discrete and combinatorial mathematics: an applied introduction. R.P. Grimaldi. Fifth Edition. ISBN: 0321211030
11 Binomial coefficients Chapter 1. Sections 1.3. Discrete and combinatorial mathematics: an applied introduction. R.P. Grimaldi. Fifth Edition. ISBN: 0321211030
12 The pigeonhole principal Chapter 5. Sections 5.5. Discrete and combinatorial mathematics: an applied introduction. R.P. Grimaldi. Fifth Edition. ISBN: 0321211030
13 Discrete probability Chapter 3. Sections 3.4 –3.6Discrete and combinatorial mathematics: an applied introduction. R.P. Grimaldi. Fifth Edition. ISBN: 0321211030
14 Graphs Chapter 11. Sections 11.1 –11.2. Discrete and combinatorial mathematics: an applied introduction. R.P. Grimaldi. Fifth Edition. ISBN: 0321211030
15 Ağaçlar / Trees Chapter 12. Discrete and combinatorial mathematics: an applied introduction. R.P. Grimaldi. Fifth Edition. ISBN: 0321211030
16 Review of the Semester  
Course Notes/Textbooks Discrete and combinatorial mathematics: an applied introduction. R.P. Grimaldi. Fifth Edition. ISBN: 0321211030
Suggested Readings/Materials

 

EVALUATION SYSTEM

Semester Activities Number Weigthing
Participation
Laboratory / Application
Field Work
Quizzes / Studio Critiques
Portfolio
Homework / Assignments
Presentation / Jury
Project
Seminar / Workshop
Oral Exam
Midterm
1
60
Final Exam
1
40
Total

Weighting of Semester Activities on the Final Grade
1
60
Weighting of End-of-Semester Activities on the Final Grade
1
40
Total

ECTS / WORKLOAD TABLE

Semester Activities Number Duration (Hours) Workload
Course Hours
(Including exam week: 16 x total hours)
16
3
48
Laboratory / Application Hours
(Including exam week: 16 x total hours)
16
Study Hours Out of Class
16
6
Field Work
Quizzes / Studio Critiques
Portfolio
Homework / Assignments
Presentation / Jury
Project
Seminar / Workshop
Oral Exam
Midterms
1
10
Final Exams
1
26
    Total
180

 

COURSE LEARNING OUTCOMES AND PROGRAM QUALIFICATIONS RELATIONSHIP

#
Program Competencies/Outcomes
* Contribution Level
1
2
3
4
5
1 Be able to define problems in real life by identifying functional and nonfunctional requirements that the software is to execute
2 Be able to design and analyze software at component, subsystem, and software architecture level X
3 Be able to develop software by coding, verifying, doing unit testing and debugging X
4 Be able to verify software by testing its behaviour, execution conditions, and expected results
5 Be able to maintain software due to working environment changes, new user demands and the emergence of software errors that occur during operation
6 Be able to monitor and control changes in the software, the integration of software with other software systems, and plan to release software versions systematically
7 To have knowledge in the area of software requirements understanding, process planning, output specification, resource planning, risk management and quality planning
8 Be able to identify, evaluate, measure and manage changes in software development by applying software engineering processes
9 Be able to use various tools and methods to do the software requirements, design, development, testing and maintenance X
10 To have knowledge of basic quality metrics, software life cycle processes, software quality, quality model characteristics, and be able to use them to develop, verify and test software X
11 To have knowledge in other disciplines that have common boundaries with software engineering such as computer engineering, management, mathematics, project management, quality management, software ergonomics and systems engineering X
12 Be able to grasp software engineering culture and concept of ethics, and have the basic information of applying them in the software engineering X
13

Be able to use a foreign language to follow related field publications and communicate with colleagues

X

*1 Lowest, 2 Low, 3 Average, 4 High, 5 Highest

 

İzmir Ekonomi Üniversitesi | Sakarya Caddesi No:156, 35330 Balçova - İZMİR Tel: +90 232 279 25 25 | webmaster@ieu.edu.tr | YBS 2010